int maxDepth(struct TreeNode* root) {
    if (root == NULL)
    {
        return 0;
    }
    else
    {
        int left = maxDepth(root->left);
        int right = maxDepth(root->right);
        return left > right ? left + 1 : right + 1;
    }
}